Fast Irreducibility and Subgroup Membership Testing in XTR
نویسندگان
چکیده
We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group. Our method is substantially faster than the general method presented at Asiacrypt 2000. As a side result, we obtain an efficient method to test subgroup membership when
منابع مشابه
The Larger Integer Library and the Diffie-Hellman Protocol based on XTR
XTR is an excellent public key system that can achieve the same communication and security advantages at a much lower computational cost because of small keys and fast key selection.XTR can apply in variety of environments that relies on the subgroup of discrete logarithm problem. This paper programs a large integer library and based on which achieves the XTR Diffie-Hellman agreement.
متن کاملEfficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions
This paper describes several speedups for computation in the order p + 1 subgroup of Fp2 and the order p 2 − p + 1 subgroup of Fp6 . These results are in a way complementary to LUC and XTR, where computations in these groups are sped up using trace maps. As a side result, we present an efficient method for XTR with p ≡ 3 mod 4.
متن کاملAn overview of the XTR public key system
XTR is a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security. This paper describes and explains the techniques and properties that are relevant for the XTR cryptosystem and its implementation. It is base...
متن کاملNotes in Computer Science 1880
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security.
متن کاملThe XTR Public Key System
This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001